A Two-Leveled Web Service Path Re-PlanningTechnique
نویسندگان
چکیده
منابع مشابه
A Two-leveledweb Service Path Re-planning Technique
Web service paths can accomplish customer requirements. During the execution of a web service path, violations of service level agreements (SLAs) will cause the path to be re-planed (healed). Existing re-planning techniques generally suffer from shortcomings of ignoring the effect of requirement change. This paper proposes a two-leveled path re-planning technique (TLPRP), which offers the follo...
متن کاملTwo-phased Web Service Discovery
Service-Oriented Architectures enable the consumption of existing services in a standardized way to solve some specific needs. In order to consume some services made available by cooperating parties e.g. for performing some business activity, such services must be located based on different criteria. In this paper, we investigate how the semantic description of the capability of Web services an...
متن کاملWeb Service Providers\' Game on Price and Service Level
Response time is one of the critical web service quality dimensions. It refers to how long it takes that a web service responds to request of a user. In order to manage the response time, pricing schemes can work as an efficient access control mechanism. In this paper, we study competition between two providers offering functionally same web services where there is a monopoly service provider...
متن کاملA Two-Leveled Mobile Agent System for Electronic Commerce SAHINGOZ, ERDOGAN A TWO-LEVELED MOBILE AGENT SYSTEM FOR ELECTRONIC COMMERCE
Electronic commerce technology offers the opportunity to integrate and optimize the global production and distribution on the supply chain. Computers of various corporations, located throughout the world, communicate with each other to determine the availability of components, to place and confirm orders, and to negotiate delivery timescales over the Internet. Software agents help to automate a...
متن کاملTrack Layouts, Layered Path Decompositions, and Leveled Planarity
We investigate two types of graph layouts, track layouts and layered path decompositions, and the relations between their associated parameters track-number and layered pathwidth. We use these two types of layouts to characterize leveled planar graphs, the graphs with planar layered drawings with no dummy vertices. It follows from the known NP-completeness of leveled planarity that track-number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal on Web Service Computing
سال: 2012
ISSN: 2230-7702
DOI: 10.5121/ijwsc.2012.3402